منابع مشابه
The Canadian Traveller Problem Revisited
This study investigates a generalization of the Canadian Traveller Problem (CTP), which finds real applications in dynamic navigation systems used to avoid traffic congestion. Given a road network G = (V,E) in which there is a source s and a destination t in V , every edge e in E is associated with two possible distances: original d(e) and jam d(e). A traveller only finds out which one of the t...
متن کاملA note on the k-Canadian Traveller Problem
We consider the online problem k-CTP, which is the problem to guide a vehicle from some site s to some site t on a road map given by a graph G = (V,E) in which up to k (unknown) edges are blocked by avalanches. An online algorithm learns from a blocked edge when reaching one of its endpoints. Thus, it might have to change its route to the target t up to k times. We show that no deterministic on...
متن کاملRoute Planning under Uncertainty: The Canadian Traveller Problem
The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an optimal policy that minimizes the expected cost of travel. The problem is known to be #P-hard. Since there has been no significant progress on approximation algorithms for several decades, we have chosen to seek out spec...
متن کاملGeneralized Canadian traveller problems
This study investigates a generalization of the Canadian Traveller Problem (CTP), which finds real applications in dynamic navigation systems used to avoid traffic congestion. Given a road network G = (V, E) in which there is a source s and a destination t in V , every edge e in E is associated with two possible distances: original d(e) and jam d+(e). A traveller only finds out which one of the...
متن کاملExact Algorithms for the Canadian Traveller Problem on Paths and Trees
The Canadian Traveller problem is a stochastic shortest paths problem in which one learns the cost of an edge only when arriving at one of its endpoints. The goal is to find an adaptive policy (adjusting as one learns more edge lengths) that minimizes the expected cost of travel. The problem is known to be #P hard. Since there has been no significant progress on approximation algorithms for sev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.02.026